NETWORK FLOW ORIENTED APPROACHES FOR VEHICLE SHARING RELOCATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
Metaheuristic Approaches for Vehicle Routing Problems
Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes th...
متن کاملPolicy Model for Sharing Network Slices in 5G Core Network
As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...
متن کاملComputational Approaches to Stochastic Vehicle Routing Problems
We develop and test several heuristics for two well-known vehicle routing problems which have stochastic demand: the probabilistic traveling salesman problem (PTSP) and the probabilistic vehicle routing problem (PVRP). The goal in these problems is to obtain optimal a priori tours, that is, tours which are designed before demands are known. We develop a number of heuristics which lead to such s...
متن کاملA Stochastic Resource-Sharing Network for Electric Vehicle Charging
We consider a distribution grid used to charge electric vehicles such that voltage drops stay bounded. We model this as a class of resource-sharing networks, known as bandwidth-sharing networks in the communication network literature. We focus on resource-sharing networks that are driven by a class of greedy control rules that can be implemented in a decentralized fashion. For a large number of...
متن کاملMulticommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2017
ISSN: 1678-5142,0101-7438
DOI: 10.1590/0101-7438.2017.037.03.0455